A complete and strongly anonymous leximin relation on infinite streams
نویسندگان
چکیده
منابع مشابه
A complete and strongly anonymous leximin relation on infinite streams
Various extensions of the leximin order to the infinite dimensional setting have been suggested. They relax completeness and strong anonymity. Instead, by removing sensitivity to generations at infinite rank this paper defines a complete and strongly anonymous leximin relation on infinite streams. The order is axiomatized, and it is shown to be the limit of extended rank-discounted utilitariani...
متن کاملQ-anonymous social welfare relations on infinite utility streams
This paper studies a class of social welfare relations (SWRs) on the set of infinite utility streams. In particular, we examine the SWRs satisfying Q-Anonymity, an impartiality axiom stronger than Finite Anonymity, as well as Strong Pareto and a certain equity axiom. First, we characterize the extension of the generalized Lorenz SWR by combining Q-Anonymity with Strong Pareto and Pigou-Dalton E...
متن کاملA relation between infinite subsets and exterior center in groups
Let G be a group. Neumann to answer a question of Paul Erdos proved that every infinite subset of G has two different comuting elements if and only if G is center-by-finite. In this paper, we deal with Erdoschr('39')s question in different aspect and we show that every infinite subset X of G has two different elements x and y such that x^y=1 if and only if the exterior center of G ihas finit...
متن کاملOn Social Welfare Functions on Infinite Utility Streams satisfying Hammond Equity and Weak Pareto axioms: A Complete Characterization∗
This paper examines the problem of aggregating infinite utility streams with a social welfare function that respects the Hammond Equity and Weak Pareto Axioms. The paper provides a complete characterization of domains (of the one period utilities) on which such an aggregation is possible. A social welfare function satisfying the Hammond Equity and Weak Pareto Axioms exists on precisely those do...
متن کاملConstraint Programming on Infinite Data Streams
Classical constraint satisfaction problems (CSPs) are commonly defined on finite domains. In real life, constrained variables can evolve over time. A variable can actually take an infinite sequence of values over discrete time points. In this paper, we propose constraint programming on infinite data streams, which provides a natural way to model constrained time-varying problems. In our framewo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Choice and Welfare
سال: 2012
ISSN: 0176-1714,1432-217X
DOI: 10.1007/s00355-012-0705-z